A Coalgebraic Perspective on Logical Interpretations
نویسندگان
چکیده
منابع مشابه
A Coalgebraic Perspective on Logical Interpretations
In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodology for rigorous program development. This paper illustrates how techniques from Algebraic Logic, in particular that of interpretation, understood as a multifunction that preserves and reflects logical consequence, capture a number of relevant transformations in the context of software design, reu...
متن کاملA Coalgebraic Perspective on Minimization and Determinization
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebraic view on systems to derive, in a uniform way, abstract procedures for checking behavioural equivalence in coalgebras, which perform (a combination of) minimization and determinization. First, we show that for coalgebra...
متن کاملA coalgebraic perspective on linear weighted automata
Article history: Received 23 March 2011 Revised 19 September 2011 Available online 30 December 2011 Weighted automata are a generalisation of non-deterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of eithe...
متن کاملLogical Interpretations of RDFS - A Compatibility Guide
This paper compares the semantics (or stated more precise: an interpretation of the intended semantics) of RDF [11] and RDFS [4] (as previously captured in [5]) with the semantics defined by the new upcoming RDF Model Theory [9]. While the RDF Model Theory Draft (MT) relies on set theory, we interpret the MT utilizing a horn subset of first order logic. On one hand, this may facilitate comprehe...
متن کاملLogical Abstract Domains and Interpretations
We give semantic foundations to abstract domains consisting in first order logic formulæ in a theory, as used in verification tools or methods using SMT-solvers or theorem provers. We exhibit conditions for a sound usage of such methods with respect to multi-interpreted semantics and extend their usage to automatic invariant generation by abstract interpretation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2013
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-013-9498-z